Approximation by piecewise polynomials on Voronoi tessellation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On 3-monotone approximation by piecewise polynomials

Abstract. We consider 3-monotone approximation by piecewise polynomials with prescribed knots. A general theorem is proved, which reduces the problem of 3-monotone uniform approximation of a 3-monotone function, to convex local L1 approximation of the derivative of the function. As the corollary we obtain Jackson-type estimates on the degree of 3-monotone approximation by piecewise polynomials ...

متن کامل

Approximation of a Spherical Tessellation by the Laguerre Voronoi Diagram

This paper presents a method for approximating spherical tessellations, the edges of which are geodesic arcs, using spherical Laguerre Voronoi diagrams. The approximation method involves fitting the polyhedron corresponding to the spherical Laguerre Voronoi diagram to the observed tessellation using optimization techniques.

متن کامل

Approximation by sums of piecewise linear polynomials

We present two partitioning algorithms that allow a sum of piecewise linear polynomials over a number of overlaying convex partitions of the unit cube Ω in Rd to approximate a function f ∈ W 3 p (Ω) with the order N−6/(2d+1) in Lp-norm, where N is the total number of cells of all partitions, which makes a marked improvement over the N−2/d order achievable on a single convex partition. The gradi...

متن کامل

Nonlinear Approximation from Differentiable Piecewise Polynomials

We study nonlinear n-term approximation in Lp(R) (0 < p ≤ ∞) from hierarchical sequences of stable local bases consisting of differentiable (i.e., Cr with r ≥ 1) piecewise polynomials (splines). We construct such sequences of bases over multilevel nested triangulations of R2, which allow arbitrarily sharp angles. To quantize nonlinear nterm spline approximation, we introduce and explore a colle...

متن کامل

Least Squares Approximation by One-Pass Methods with Piecewise Polynomials

We propose several one-pass methods for data fitting in which a piecewise polynomial is used as an approximating function. The polynomial pieces are calculated step-by-step by the method of least squares as the data is -----------,scaIIIIed umy-once-from the begimring La tIre end. To calculate the least squares fitting in each step, we use three classes of data, namely: the data in the current ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Graphical Models

سال: 2014

ISSN: 1524-0703

DOI: 10.1016/j.gmod.2014.04.006